Hybrid Formulation of the Multi-Item Capacitated Dynamic Lot Sizing Problem
نویسندگان
چکیده
منابع مشابه
A Heuristic Solution of Multi-item Single Level Capacitated Dynamic Lot-sizing Problem
The multi-item single level capacitated dynamic lot-sizing problem consists of scheduling N items over a horizon of T periods. The objective is to minimize the sum of setup and inventory holding costs over the horizon subject to a constraint on total capacity in each period. No backlogging is allowed. Only one machine is available with a fixed capacity in each period. In case of a single item p...
متن کاملProbabilistic Analysis of Multi-Item Capacitated Lot Sizing Problems
This paper conducts a probabilistic analysis of an important class of heuristics for multiitem capacitated lot sizing problems. We characterize the asymptotic performance of so-called progressive interval heuristics as T , the length of the planning horizon, goes to infinity, assuming the data are realizations of a stochastic process of the following type: the vector of cost parameters follows ...
متن کاملProgressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...
متن کاملThree Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کاملStrong Formulations for Multi-item Capacitated Lot Sizing*
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems vnth up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2015
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2015.56039